翻訳と辞書 Words near each other ・ Necking ・ Necking (engineering) ・ Necklace ・ Necklace (combinatorics) ・ Necklace (disambiguation) ・ Necklace and Calabash ・ Necklace carpetshark ・ Necklace fern ・ Necklace Nebula ・ Necklace of Harmonia ・ Necklace of Precious Pearls ・ Necklace of the Stars ・ Necklace of Venus ・ Necklace pipistrelle ・ Necklace polynomial ・ Necklace problem ・ Necklace ring ・ Necklace Road ・ Necklace Road railway station ・ Necklace splitting problem ・ Necklaced spinetail ・ Necklacing ・ Neckline ・ Necks ・ Necks (EP) ・ Necktie ・ Necktie paradox ・ Necktie River ・ Necktie Second ・ Necktie social Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Necklace problem ： ウィキペディア英語版 Necklace problem The necklace problem is a problem in recreational mathematics, solved in the early 21st century. == Formulation == The necklace problem involves the reconstruction of a necklace of ''n'' beads, each of which is either black or white, from partial information. A ''k''-configuration in a necklace is a subset of ''k'' positions in the necklace; two configurations are isomorphic if one can be obtained from the other by a rotation of the necklace. At stage ''k'' of the reconstruction process, the partial information available at that stage is a count, for each ''k''-configuration, of the number of ''k''-configurations that are isomorphic to it and that contain only black beads. The necklace problem is: given ''n'', how many stages are needed (in the worst case) in order to reconstruct the precise pattern of black and white beads in the original necklace? 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Necklace problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.